Survivable Network Design with Degree or Order Constraints
نویسندگان
چکیده
منابع مشابه
Survivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملNetwork-Design with Degree Constraints
We study several network design problems with degree constraints. For the degree-constrained 2-connected subgraph problem we obtain a factor 6 violation for the degrees with 4 approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at least k ter...
متن کاملNetwork Design with Weighted Degree Constraints
In an undirected graph G = (V,E) with a weight function w : E×V → Q+, the weighted degree dw(v;E) of a vertex v is defined as ∑ {w(e, v) | e ∈ E incident with v}. In this paper, we consider a network design problem with upper-bound on weighted degree of each vertex. Inputs of the problem are an undirected graph G = (V,E) with E = E1 ∪̇ E2 ∪̇ E3, weights w1 : E1 × V → Q+, μ : E2 → Q+, ν : E3 → Q+,...
متن کاملSupply chain network design with multi- mode demand based on acceptance degree of fuzzy constraints violated
This paper designs a mathematical model for supply chain network design problem including plants, distributors and customers in fuzzy environment. Each plant and distributor has several levels capacities. A multi-mode demand strategy is considered for the customers where only one of the modes is to be selected for each customer. Considering the acceptance degree of fuzzy constraints violated, a...
متن کاملImproved Algorithm for Degree Bounded Survivable Network Design Problem
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2009
ISSN: 0097-5397,1095-7111
DOI: 10.1137/070700620